Herbal Compound Screening with GPU Computation on ZINC Database through Similarity Comparison Approach
نویسندگان
چکیده
Covid-19 is a global pandemic that drives many researchers to strive look for its solution, especially in the field of health, medicine, and total countermeasures. Early screening with in-silico processes crucial minimize search space potential drugs cure disease. This research aims find covid-19 disease ZINC database be further investigated through in-vitro method. About 997.402.117 chemical compounds are searched about their similarity some confirmed combat coronavirus. Sequential computation would take months accomplish this task. The general programming graphic processing unit approach used implement comparison algorithm parallel, order speed up process. result study shows parallel implementation can process 55 times faster, also have high scores found nature
منابع مشابه
SW#db: GPU-Accelerated Exact Sequence Similarity Database Search
In recent years we have witnessed a growth in sequencing yield, the number of samples sequenced, and as a result-the growth of publicly maintained sequence databases. The increase of data present all around has put high requirements on protein similarity search algorithms with two ever-opposite goals: how to keep the running times acceptable while maintaining a high-enough level of sensitivity....
متن کاملMaterials Screening Through GPU Accelerated Topological Mapping
depiction of complex void space topology of nano-porous materials. Journal of Chemical Information and Model-ing 2010, 50 (4), 461–469. 20. Oganov, A.R., Ed. Modern Methods of Crystal StructurePrediction. Wiley-VCH: Weinheim, Germany, 2010.21. Ciobanu, C.V.; Wang, C.-Z.; Ho, K.-M. Atomic StructurePrediction of Nanostructures, Clusters, and Surfaces. Wiley-VCH: Weinheim, Germ...
متن کاملComputation of Similarity - Similarity Search as Computation
We present a number of applications in Natural Language Processing where the main computation consists of a similarity search for an input pattern in a large database. Afterwards we describe some efficient methods and algorithms for solving this computational challenge. We discuss the view of the similarity search as a special kind of computation, which is remarkably common in applications of C...
متن کاملVoxelized Minkowski sum computation on the GPU with robust culling
We present a new approach for computing the voxelized Minkowski sum (excluding any enclosed voids) of two polyhedral objects using programmable Graphics Processing Units (GPUs). We first cull out surface primitives that will not contribute to the final boundary of the Minkowski sum, analyzing and adaptively bounding the rounding errors of the culling algorithm to solve the floating point error ...
متن کاملBipartite Graph Matching Computation on GPU
The Bipartite Graph Matching Problem is a well studied topic in Graph Theory. Such matching relates pairs of nodes from two distinct sets by selecting a subset of the graph edges connecting them. Each edge selected has no common node as its end points to any other edge within the subset. When the considered graph has huge sets of nodes and edges the sequential approaches are impractical, specia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Khazanah informatika
سال: 2022
ISSN: ['2621-038X', '2477-698X']
DOI: https://doi.org/10.23917/khif.v8i2.16349